Algorithms for dominating clique problems
نویسندگان
چکیده
منابع مشابه
Exact Algorithms for Dominating Clique Problems
We handle in this paper three dominating clique problems, namely, the decision problem itself when one asks if there exists a dominating clique in a graph G and two optimization versions where one asks for a maximumand a minimum-size dominating clique, if any. For the three problems we propose optimal algorithms with provably worst-case upper bounds improving existing ones by (D. Kratsch and M....
متن کاملEfficient algorithms for clique problems
The k-clique problem is a cornerstone of NP-completeness and parameterized complexity. When k is a fixed constant, the asymptotically fastest known algorithm for finding a k-clique in an n-node graph runs in O(n) time (given by Nešetřil and Poljak). However, this algorithm is infamously inapplicable, as it relies on Coppersmith and Winograd’s fast matrix multiplication. We present good combinat...
متن کاملParallel algorithms for generalized clique transversal problems
The K `-clique transversal problem is to locate a minimum collection of cliques of size ` in a graph G such that every maximal clique of sizè in G contains at least one member of the collection. We give an NC algorithm to solve this problem on strongly chordal graphs.
متن کاملClique-like Dominating Sets
Continuing work by B acso and Tuza and Cozzens and Kelleher, we investigate dominating sets which induce subgraphs with small clique covering number, or small independence number. We show that if a graph G is connected and contains no induced subgraph isomorphic to P6 or Ht (the graph obtained by subdividing each edge of K1;t; t 3), then G has a dominating set which induces a connected graph wi...
متن کاملFixed Parameter Algorithms for PLANAR DOMINATING SET and Related Problems
We present an algorithm that constructively produces a solution to the k-dominating set problem for planar graphs in time O(c √ n), where c = 36 √ 34. To obtain this result, we show that the treewidth of a planar graph with domination number γ(G) is O( √ γ(G)), and that such a tree decomposition can be found in O( √ γ(G)n) time. The same technique can be used to show that the k-face cover probl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2012
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2012.07.016